Set Constraints with Intersection
نویسندگان
چکیده
منابع مشابه
Set Constraints with Intersection
Set constraints are inclusions between expressions denoting sets of trees. The eficiency of their satisfiabili ty test is a central issue in set-based program analysis, their main application domain. W e introduce the class of set constraints with intersection (the only operators forming the expressions are constructors and intersection) and show that i ts satisfiability problem as DEXPTIME-com...
متن کاملSet systems with union and intersection constraints
Let 2 ≤ d ≤ k be fixed and n be sufficiently large. Suppose that G is a collection of k-element subsets of an n-element set, and |G| > ( n−1 k−1 ) . Then G contains d sets with union of size at most 2k and empty intersection. This verifies a conjecture of the first author for large n.
متن کاملImproved Bounds on Families Under k -wise Set-Intersection Constraints
Let p be a prime, and let L be a set of s congruence classes modulo p. Let H be a family of subsets of [n] such that the size modulo p of each member of H is not in L, but the size modulo p of every intersection of k distinct members of H is in L. We prove that |H| ≤ (k − 1) ∑s i=0 ( n−1 i ) , improving the bound due to Grolmusz and generalizing results proved for k = 2 by Snevily.
متن کاملDisjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints. These global constraints fall into one of three classes. In the first class, we show that we can decompose the constraint without hindering bound consistency. No new algorithms therefore need be developed for such constraints. In the second ...
متن کاملMatroid Intersection with Priority Constraints
In this paper, we consider the following variant of the matroid intersection problem. We are given two matroids M1,M2 on the same ground set E and a subset A of E. Our goal is to find a common independent set I of M1,M2 such that |I ∩A| is maximum among all common independent sets of M1,M2 and such that (secondly) |I| is maximum among all common independent sets of M1,M2 satisfying the first co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2001.2952